Agents for Concurrent Programming

نویسندگان

  • Enrique GONZALEZ
  • César BUSTACARA
  • Jamir AVILA
چکیده

This paper aims to demonstrate that concepts from Distributed Artificial Intelligence are very useful to design concurrent systems. The BESA framework and the AOPOA methodology are introduced as tools to achieve this goal. The Behavior-oriented, Event-driven and Social-based Agent (BESA) framework combines the concepts of MultiAgent Systems with the design of concurrent systems: an agent can be constructed as a set of behaviors; the notion of behaviors can be directly applied to concurrent systems design using the Agent Oriented Programming paradigm. The internal architecture of a BESA agent integrates two important features: a modular composition of behaviors and an event dispatcher based in a select like mechanism. The Agent Oriented Programming based in an Organizational Approach (AOPOA) methodology provides a systematic procedure to build complex system based in three concepts: a hierarchical recursive decomposition of the system, a goal-oriented role identification, and an evolution of the cooperation relationships linking the system components.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Executable Speci cations for Concurrent Programming

Concurrent programming has been diicult to do, both from a programming and a formal ver-iication perspective. The main reasons are that the concurrency constructs are low-level and their use is intertwined with the rest of the program. In this paper, we use as a basis a new concurrent programming model called Open Constraint Programming. Its roots are in Concurrent Constraint Programming where ...

متن کامل

Mapping Object Descriptions to Behaviours 1 Working paper

There is a lack of good formalisms and tools for describing the semantics of object-oriented and concurrent programming languages. We propose a computational model for objects in which events are synchronous communications between concurrent agents, computations are partial orderings of events, and behaviours are the possible event unfoldings in which an agent, or a system of concurrent agents,...

متن کامل

Concurrent Programming with Multi-Agents and the Chemical Abstract Machine

In this chapter, we propose a new concurrent programming approach called MACH (multi-agent extended chemical abstract machine). MACH extends the chemical abstract machine with multiple coexisting agents. This paper focuses on the design, implementation, and verification of MACH. The aim of MACH is to develop a reactive programming language based on an interactive computational model, which we b...

متن کامل

Further Investigations into the Evolution of Agents with Concurrent Genetic Programming

This paper follows from previous work by the author in [1, 2], where controllers were evolved for agents in virtual block-worlds. The agent's behaviour is determined by a set of genetically evolved programs executed in a concurrent fashion. The motivation behind this work is threefold: rst, to investigate the use of concurrency in genetic programming, second, to examine the ability of this para...

متن کامل

GUARDNET: A Distributed and Concurrent Programming Environment for Multi-Agent Systems

GuardNet is a programming environment that supports distributed and concurrent development o f m ulti-agent systems. Since agents in multi-agent s y s t e m s are distributed and work concurrently, they are often developed distributively and concurrently. Because GuardNet itself is a multi-agent system, GuardNet provides the following three services to support programmers developing such m ulti...

متن کامل

A Fair Extension of (Soft) Concurrent Constraint Languages

The aim of this paper is to guarantee fair computations in (Soft) Concurrent Constraint languages. We present an extension of the semantics related to the operator of parallelism in order to allow a “fair” selection for the execution of concurrent agents. We define a new operator of Parallelism (‖m) which is able to deal with a finite number (m) of agents. Subsequently we apply the general rule...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003